Hamiltonian cycles in 3‐tough 2 K 2 ‐free graphs
نویسندگان
چکیده
منابع مشابه
Improved degree conditions for 2-factors with k cycles in hamiltonian graphs
In this paper, we consider conditions that ensure a hamiltonian graph has a 2-factor with exactly k cycles. Brandt et al. proved that if G is a graph on n ≥ 4k vertices with minimum degree at least n2 , then G contains a 2-factor with exactly k cycles; moreover this is best possible. Faudree et al. asked if there is some c < 1 2 such that δ(G) ≥ cn would imply the existence of a 2-factor with k...
متن کامل2-Factor hamiltonian graphs
The Heawood graph and K3;3 have the property that all of their 2-factors are Hamilton circuits. We call such graphs 2-factor hamiltonian. We prove that if G is a k-regular bipartite 2factor hamiltonian graph then either G is a circuit or k 1⁄4 3: Furthermore, we construct an infinite family of cubic bipartite 2-factor hamiltonian graphs based on the Heawood graph and K3;3 and conjecture that th...
متن کاملFault-Free Hamiltonian Cycles in Faulty Arrangement Graphs
The arrangement graph An,k, which is a generalization of the star graph (n − k = 1), presents more flexibility than the star graph in adjusting the major design parameters: number of nodes, degree, and diameter. Previously, the arrangement graph has proved Hamiltonian. In this paper, we further show that the arrangement graph remains Hamiltonian even if it is faulty. Let Fe and Fv denote ...
متن کامل2-Factors in Hamiltonian Graphs
We show that every hamiltonian claw-free graph with a vertex x of degree d(x) ≥ 7 has a 2-factor consisting of exactly two cycles.
متن کاملLong Cycles in 2-Connected Triangle-Free Graphs
Dirac showed that a 2–connected graph of order n with minimum degree δ has circumference at least min{2δ, n}. We prove that a 2– connected, triangle-free graph G of order n with minimum degree δ either has circumference at least min{4δ−4, n}, or every longest cycle in G is dominating. This result is best possible in the sense that there exist bipartite graphs with minimum degree δ whose longest...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Theory
سال: 2019
ISSN: 0364-9024,1097-0118
DOI: 10.1002/jgt.22526